Binary words avoiding the pattern AABBCABBA
نویسندگان
چکیده
منابع مشابه
Pattern 1^j0^i avoiding binary words
In this paper we study the enumeration and the construction, according to the number of ones, of particular binary words avoiding the fixed pattern p( j, i) = 1 j0i, 0 < i < j. The growth of such words can be described by particular jumping and marked succession rules. This approach enables us to obtain an algorithm which constructs all binary words having a fixed number of ones and then kills ...
متن کاملBinary words avoiding a pattern and marked succession rule
In this paper we study the enumeration and the construction of particular binary words avoiding the pattern 10. By means of the theory of Riordan arrays, we solve the enumeration problem and we give a particular succession rule, called jumping and marked succession rule, which describes the growth of such words according to their number of ones. Moreover, the problem of associating a word to a ...
متن کاملPattern-avoiding alternating words
Abstract. A word w = w1w2 · · ·wn is alternating if either w1 < w2 > w3 < w4 > · · · (when the word is up-down) or w1 > w2 < w3 > w4 < · · · (when the word is down-up). In this paper, we initiate the study of (pattern-avoiding) alternating words. We enumerate up-down (equivalently, down-up) words via finding a bijection with order ideals of a certain poset. Further, we show that the number of 1...
متن کاملCounting Binary Words Avoiding Alternating Patterns
Let F [p] denote the set of binary words, with no more 0’s than 1’s, that do not contain the pattern p = (10)1 as a factor for any fixed j ≥ 1. We give the generating function for the integer sequence enumerating, according to the number of 1’s, the words in F [p].
متن کاملGrowth rate of binary words avoiding xxxR
Consider the set of those binary words with no non-empty factors of the form xxx R. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the existence of upper and lower bounds on the number of such words of length n, where each of these bounds is asymptotically equivalent to a (different) function of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2010
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2010010